The Tra c Equilibrium Problem with Nonadditive Path CostsSteven
نویسندگان
چکیده
In this paper we present a version of the (static) traac equilibrium problem in which the cost incurred on a path is not simply the sum of the costs on the arcs that constitute that path. We motivate this nonadditive version of the problem by describing several situations in which the classical additiv-ity assumption fails. We also present an algorithm for solving nonadditive problems that is based on the recent NE/SQP algorithm, a fast and robust method for the nonlinear complementarity problem. Finally, we present a small example that illustrates both the importance of using nonadditive costs and the eeectiveness of the NE/SQP method.
منابع مشابه
The Traffic Equilibrium Problem with Nonadditive Path Costs
In this paper we present a version of the (static) traac equilibrium problem in which the cost incurred on each path is not simply the sum of the costs on the arcs that constitute that path. We motivate this nonadditive version of the problem by describing several situations in which the classic additivity assumption fails. We describe existence and uniqueness conditions for this problem and we...
متن کاملSolving the Nonadditive Traac Equilibrium Problem
In this paper we develop an algorithm for solving a version of the (static) traac equilibrium problem in which the cost incurred on each path is not simply the sum of the costs on the arcs that constitute that path. The method we describe is based on the recent NE/SQP algorithm , a fast and robust technique for solving nonlinear complementarity problems. Finally, we present an example that illu...
متن کاملPii: S0191-2615(97)00031-3
ÐIn this paper, the Dynamic Trac Routing problem is de®ned as the real-time point diversion of trac during non-recurrent congestion. This dynamic trac routing problem is then formulated as a feedback control problem that determines the time-dependent split parameters at the diversion point for routing the incoming trac ̄ow onto the alternate routes in order to achieve a user-equilibrium tra...
متن کاملMethods of Reducing the Number of Effective ODs in Order to Solve Traffic Equilibrium Problem in Real Life Networks
Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...
متن کاملMethods of Reducing the Number of Effective ODs in Order to Solve Traffic Equilibrium Problem in Real Life Networks
Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...
متن کامل